Computing Approximate Greatest Common Right Divisors of Differential Polynomials
نویسندگان
چکیده
منابع مشابه
Computing Approximate Greatest Common Right Divisors of Differential Polynomials
Differential (Ore) type polynomials with “approximate” polynomial coefficients are introduced. These provide an effective notion of approximate differential operators, with a strong algebraic structure. We introduce the approximate Greatest Common Right Divisor Problem (GCRD) of differential polynomials, as a non-commutative generalization of the well-studied approximate GCD problem. Given two ...
متن کاملApproximate Greatest Common Divisors and Polynomials Roots
This lecture will show by example some of the problems that occur when the roots of a polynomial are computed using a standard polynomial root solver. In particular, polynomials of high degree with a large number of multiple roots will be considered, and it will be shown that even roundoff error due to floating point arithmetic, in the absence of data errors, is sufficient to cause totally inco...
متن کاملComputing Greatest Common Divisors and Factorizations
In a quadratic number field Q(V~D), D a squarefree integer, with class number 1, any algebraic integer can be decomposed uniquely into primes, but for only 21 domains Euclidean algorithms are known. It was shown by Cohn [5] that for D < —19 even remainder sequences with possibly nondecreasing norms cannot determine the GCD of arbitrary inputs. We extend this result by showing that there does no...
متن کاملComplexity of Algorithms for Computing Greatest Common Divisors of Parametric Univariate Polynomials
This paper presents a comparison between the complexity bounds of different algorithms for computing greatest common divisor of a finite set of parametric univariate polynomials. Each algorithm decomposes the parameters space into a finite number of constructible sets such that a greatest common divisor of the parametric univariate polynomials is given uniformly in each constructible set. The f...
متن کاملComputing Greatest Common Divisors and Factorizations in Quadratic Number Fields*
In a quadratic number field Q(√ D ), D a squarefree integer, with class number 1 any algebraic integer can be decomposed uniquely into primes but for only 21 domains Euclidean algorithms are known. It was shown by Cohn [5] that for D ≤ – 19 even remainder sequences with possibly non-decreasing norms cannot determine the GCD of arbitrary inputs. We extend this result by showing that there does...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2019
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-019-09422-2